# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可

    def minimumDeletions(self, nums: List[int]) -> int:
        min_value = min(nums)
        max_value = max(nums)
        nums_len = len(nums)

        min_index = nums.index(min_value)
        max_index = nums.index(max_value)

        l, r = min_index, max_index

        if min_index > max_index:
            l = max_index
            r = min_index

        ans = min(l + 1 + nums_len - r, r + 1, nums_len - l)

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([2, 10, 7, 5, 4, 1, 8, 6], 5),
        ([0, -4, 19, 1, 8, -2, -3, 5], 3),
        ([101], 1)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.minimumDeletions(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)
